Online coloring graphs with high girth and high odd girth

نویسنده

Judit Nagy-György

چکیده

We give an upper bound for the online chromatic number of graphs with high girth and for graphs with high oddgirth generalizing Kierstead’s algorithm for graphs that contain neither a C3 or C5 as an induced subgraph. keywords: online algorithms, combinatorial problems

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Colorings of Graphs Power

In this paper some coloring properties of graphs power have been presented. In this regard, the helical graphs have been introduced and it was shown that they are hom-universal with respect to high odd-girth graphs whose lth power is bounded with a Kneser graph. In the sequel, we have considered Pentagon’s problem of Nešetřil which this problem is about the existence of high girth cubic graphs ...

متن کامل

High-Girth Graphs Avoiding a Minor are Nearly Bipartite

Let H be a xed graph. We show that any H-minor free graph of high enough girth has a circular-chromatic number arbitrarily close to two. Equivalently, such graphs have homomorphisms into a large odd circuit. In particular, graphs of high girth and of bounded genus or bounded tree width are \nearly bipartite" in this sense. For example, any planar graph of girth at least 16 admits a homomorphism...

متن کامل

(2 + ϵ)-Coloring of planar graphs with large odd-girth

The odd-girth of a graph is the length of a shortest odd circuit. A conjecture by Pavol Hell about circular coloring is solved in this article by showing that there is a function f( ) for each : 0 < < 1 such that, if the odd-girth of a planar graph G is at least f( ), then G is (2 + )-colorable. Note that the function f( ) is independent of the graph G and → 0 if and only if f( )→∞. A key lemma...

متن کامل

Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph

Let G be a graph and let c : V (G) → ({1,...,5} 2 ) be an assignment of 2-element subsets of the set {1, . . . , 5} to the vertices of G such that for every edge vw, the sets c(v) and c(w) are disjoint. We call such an assignment a (5, 2)-coloring. A graph is (5,2)-colorable if and only if it has a homomorphism to the Petersen graph. The odd-girth of a graph G is the length of the shortest odd ...

متن کامل